Duality for Robust Linear Infinite Programming Problems Revisited
نویسندگان
چکیده
منابع مشابه
SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملRobust linear semi-infinite programming duality under uncertainty
In this paper, we propose a duality theory for semi-infinite linear programming problems under uncertainty in the constraint functions, the objective function, or both, within the framework of robust optimization. We present robust duality by establishing strong duality between the robust counterpart of an uncertain semi-infinite linear program and the optimistic counterpart of its uncertain La...
متن کاملExponential membership function and duality gaps for I-fuzzy linear programming problems
Fuzziness is ever presented in real life decision making problems. In this paper, we adapt the pessimistic approach tostudy a pair of linear primal-dual problem under intuitionistic fuzzy (I-fuzzy) environment and prove certain dualityresults. We generate the duality results using exponential membership and non-membership functions to represent thedecision maker’s satisfaction and dissatisfacti...
متن کاملsolving fuzzy linear programming problems with linear membership functions-revisited
recently, gasimov and yenilmez proposed an approach for solving two kinds of fuzzy linear programming (flp) problems. through the approach, each flp problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. then, the crisp problem is solved by the use of the modified subgradient method. in this paper we will have another look at the earlier defuzzifi...
متن کاملDuality in infinite dimensional linear programming
We consider the class of linear programs with infinitely many variables and constraints having the property that every constraint contains at most finitely many variables while every variable appears in at most finitely many constraints. Examples include production planning and equipment replacement over an infinite horizon. We form the natural dual linear programming problem and prove strong d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vietnam Journal of Mathematics
سال: 2020
ISSN: 2305-221X,2305-2228
DOI: 10.1007/s10013-020-00383-6